1790B - Taisia and Dice - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
 
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x).size()
#define vt vector
#define pi pair<int,int>
#define ll long long

int caseNum = 1;
string piNum = "314159265358979323846264338327950288419716939937510";
void printCase(ll val) {
	cout << "Case #" << caseNum << ": " << val << "\n";
}
void solve() {
	int n,s,r;
	cin >> n >> s >> r;
	int m = s - r;
	//n integers, sum up to s and has max value of m
	vt<int> dice;
	for (int i = 0; i < n; i++) dice.pb(0);
	int curr = 0;
	int idx = 0;
	while(curr < s) {
		dice[idx % n]++;
		curr++;
		idx++;
	}
	sort(dice.begin(), dice.end());
	if(dice[n - 1] != m) {
		int need = m - dice[n-1];
		for (int i = n - 2; i >= 0; i--) {
			int max_give = dice[i] - 1;
			int give = min(need, max_give);
			dice[n-1] += give;
			dice[i] -= give;
			need -= give;
		}
	}
	for (int i = 0; i < n; i++) {
		cout << dice[i] << " ";
	}
	cout << "\n";
}
int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; i++) {
		solve();
		caseNum++;
	}
}